منابع مشابه
Packing bounded-degree spanning graphs from separable families
Let G be a separable family of graphs. Then for all positive constants and ∆ and for every su ciently large integer n, every sequence G1, . . . , Gt ∈ G of graphs of order n and maximum degree at most ∆ such that e(G1)+· · ·+e(Gt) ≤ (1− ) ( n 2 ) packs into Kn. This improves results of Böttcher, Hladký, Piguet, and Taraz when G is the class of trees and of Messuti, Rödl, and Schacht in the case...
متن کاملHeight, Width and Bounded Packing for Stable Subgroups
In this note, we show that a finite collection of stable subgroups of a finitely generated group has finite height, finite width and bounded packing.
متن کاملSeparable subgroups of mapping class groups
We investigate the separability of several well known classes of subgroups of the mapping class group of a surface.
متن کاملFinite Index Subgroups of Conjugacy Separable Groups
We construct an example of conjugacy separable group possessing a not conjugacy separable subgroup of finite index. We give also a sufficient condition for a conjugacy separable group to preserve this property when passing to subgroups of finite index. We establish also conjugacy separability of finitely presented residually free groups using impressive results of Bridson and Wilton [BW-07].
متن کاملTwo-Bounded-Space Bin Packing Revisited
We analyze approximation algorithms for bounded-space bin packing by comparing them against the optimal bounded-space packing (instead of comparing them against the globally optimal packing that does not necessarily satisfy the bounded-space constraint). For 2-boundedspace bin packing we construct a polynomial time offline approximation algorithm with asymptotic worst case ratio 3/2, and we sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2011
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-2011-10788-3